MULTIPLICATIVE APPROXIMATION METHOD OF FUNCTIONAL DEPENDENCIES BY LINE SEGMENTS

نویسندگان

چکیده

The article is devoted to the approximation problems of functional dependencies during conversions performed in intelligent measurement devices. Non-linearities are essential parts most control processes and systems. When using a nonlinear transmitter with conversion function information systems used various fields, it necessary perform operations on numbers microprocessors/microcontrollers direct indirect measurements. For this purpose, methods used. purpose describe functions simpler, more convenient way for utilization calculations, an insignificantly small loss accuracy. Existent linearization, although some them effective, can be burdensome implementation microprocessor-based Here, one proposed by line segments proposed. In method, range argument changes divided into segments, coordinate system bisector, remaining within function, swapped approximation. Having involved few simple mathematical operations, method implemented efficiently approximations

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Method on Tracking Unit Pixel Width Line Segments for Function Approximation-Based Image Coding

In this paper, we propose a novel method on tracking unit pixel width line segments for function approximation-based image coding. This method is applied prior to function approximation of line segments in image coding. Compared to conventional methods, our method overcomes the problems introduced by inaccurately tracking unit pixel width contours that appear normally in images of fine details ...

متن کامل

Stabbing Line Segments with Disks: Complexity and Approximation Algorithms

Computational complexity is studied for the problem of stabbing set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms straight line drawing of planar graph. This problem along with its relatives [3] arise in physical network security analysis for telecommunication, wireless and road networks represented by geometric graphs ...

متن کامل

Intersecting straight line segments with disks: complexity and approximation

Computational complexity and approximability are studied for a problem of intersecting a set of straight line segments with the smallest cardinality set of disks of fixed radii r > 0 where the set of segments forms a straight line drawing G = (V,E) of a planar graph without edge crossings. Similar problems arise e.g. in network security applications (Agarwal et al., 2013). We claim strong NP-ha...

متن کامل

Approximation Measures for Conditional Functional Dependencies Using Stripped Conditional Partitions

Received Apr 11, 2017 Revised May 5, 2017 Accepted May 24, 2017 Conditional functional dependencies (CFDs) have been used to improve the quality of data, including detecting and repairing data inconsistencies. Approximation measures have significant importance for data dependencies in data mining. To adapt to exceptions in real data, the measures are used to relax the strictness of CFDs for mor...

متن کامل

An Axiomatic Approach to Defining Approximation Measures for Functional Dependencies

We consider the problem of defining an approximation measure for functional dependencies (FDs). An approximation measure for X → Y is a function mapping relation instances, r, to non-negative real numbers. The number to which r is mapped, intuitively, describes the “degree” to which the dependency X → Y holds in r. We develop a set of axioms for measures based on the following intuition. The de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Sistemi upravlìnnâ, navìgacìï ta zv?âzku

سال: 2022

ISSN: ['2073-7394']

DOI: https://doi.org/10.26906/sunz.2022.2.037